Translation-based approaches for solving disjunctive temporal problems with preferences

Disjunctive Temporal Problems (DTPs) with Preferences (DTPPs) extend DTPs with piece-wise constant preference functions associated to each constraint of the form l 64 x 12 y 64 u, where x, y are (real or integer) variables, and l, u are numeric constants. The goal is to find an assignment to the variables of the problem that maximizes the sum of the preference values of satisfied DTP constraints, where such values are obtained by aggregating the preference functions of the satisfied constraints in it under a \u201cmax\u201d semantic. The state-of-the-art approach in the field, implemented in the native DTPP solver Maxilitis, extends the approach of the native DTP solver Epilitis. In this paper we present alternative approaches that translate DTPPs to Maximum Satisfiability of a set of Boolean combination of constraints of the form l ./ x 12 y ./ u, ./ 08 {<, 64}, that extend previous work dealing with constant preference functions only. We prove correctness and completeness of the approaches. Results obtained with the Satisfiability Modulo Theories (SMT) solvers Yices and MathSAT on randomly generated DTPPs and DTPPs built from real-world benchmarks, show that one of our translation is competitive to, and can be faster than, Maxilitis

An Efficient Hybrid Planning Framework for In-Station Train Dispatching

In-station train dispatching is the problem of optimising the effective utilisation of available railway infrastructures for mitigating incidents and delays. This is a fundamental problem for the whole railway network efficiency, and in turn for the transportation of goods and passengers, given that stations are among the most critical points in networks since a high number of interconnections of trains’ routes holds therein. Despite such importance, nowadays in-station train dispatching is mainly managed manually by human operators. In this paper we present a framework for solving in-station train dispatching problems, to support human operators in dealing with such task. We employ automated planning languages and tools for solving the task: PDDL+ for the specification of the problem, and the ENHSP planning engine, enhanced by domain-specific techniques, for solving the problem. We carry out a in-depth analysis using real data of a station of the North West of Italy, that shows the effectiveness of our approach and the contribution that domain-specific techniques may have in efficiently solving the various instances of the problem. Finally, we also present a visualisation tool for graphically inspecting the generated plans

Solving Operating Room Scheduling Problems with Surgical Teams via Answer Set Programming

The optimization of daily operating room surgery schedule can be problematic because of many constraints, like to determine the starting time of different surgeries and allocating the required resources, including the availability of surgical teams for complete surgical procedures. Recently, Answer Set Programming (ASP) has been successfully employed for addressing and solving real-life scheduling and planning problems in the healthcare domain. In this paper we present an enhanced solution using ASP for scheduling operating rooms taking explicitly into consideration availability of surgical teams, that include a surgeon and an anesthetist in different specialties for the entire duration of the surgery. We tested our solution on different benchmarks with realistic parameters for schedule’s length up to the target 5-days planning. The results of our experiments show that ASP is a suitable methodology for solving also such enhanced problem

An ASP-Based Approach to Scheduling Pre-operative Assessment Clinic

The problem of scheduling Pre-Operative Assessment Clinic (PAC) consists of assigning patients to a day for the exams needed before a surgical procedure, taking into account patients with different priority levels, due dates, and operators availability. Realizing a satisfying schedule is of upmost importance for a clinic, since delay in PAC can cause delay in the subsequent phases, causing a decrease in patients’ satisfaction. In this paper, we divide the problem in two sub-problems: In the first sub-problem patients are assigned to a day taking into account a default list of exams; then, in the second sub-problem, having the actual list of exams needed by each patient, we use the results of the first sub-problem to assign a starting time to each exam. We first present a mathematical formulation for both problems. Then, we present solutions based on Answer Set Programming (ASP): The first solution is a genuine ASP encoding of the sub-problems, while the second introduces domain-specific optimizations. Experiments show that both solutions provide satisfying results in short time, while the second is able to prove optimality faster

Operating Room (Re)Scheduling with Bed Management via ASP

The Operating Room Scheduling (ORS) problem is the task of assigning patients to operating rooms (ORs), taking into account different specialties, lengths, and priority scores of each planned surgery, OR session durations, and the availability of beds for the entire length of stay (LOS) both in the Intensive Care Unit (ICU) and in the wards. A proper solution to the ORS problem is of primary importance for the healthcare service quality and the satisfaction of patients in hospital environments. In this paper we first present a solution to the problem based on Answer Set Programming (ASP). The solution is tested on benchmarks with realistic sizes and parameters, on three scenarios for the target length on 5-day scheduling, common in small-medium-sized hospitals, and results show that ASP is a suitable solving methodology for the ORS problem in such setting. Then, we also performed a scalability analysis on the schedule length up to 15 days, which still shows the suitability of our solution also on longer plan horizons. Moreover, we also present an ASP solution for the rescheduling problem, that is, when the offline schedule cannot be completed for some reason. Finally, we introduce a web framework for managing ORS problems via ASP that allows a user to insert the main parameters of the problem, solve a specific instance, and show results graphically in real time

Evaluation Techniques and Systems for Answer Set Programming: a Survey

Answer set programming (ASP) is a prominent knowledge representation and reasoning paradigm that found both industrial and scientific applications. The success of ASP is due to the combination of two factors: a rich modeling language and the availability of efficient ASP implementations. In this paper we trace the history of ASP systems, describing the key evaluation techniques and their implementation in actual tools

An ASP-based Solution to the Chemotherapy Treatment Scheduling problem

The problem of scheduling chemotherapy treatments in oncology clinics is a complex problem, given that the solution has to satisfy (as much as possible) several requirements such as the cyclic nature of chemotherapy treatment plans, maintaining a constant number of patients, and the availability of resources, for example, treatment time, nurses, and drugs. At the same time, realizing a satisfying schedule is of upmost importance for obtaining the best health outcomes. In this paper we first consider a specific instance of the problem which is employed in the San Martino Hospital in Genova, Italy, and present a solution to the problem based on Answer Set Programming (ASP). Then, we enrich the problem and the related ASP encoding considering further features often employed in other hospitals, desirable also in S. Martino, and/or considered in related papers. Results of an experimental analysis, conducted on the real data provided by the San Martino Hospital, show that ASP is an effective solving methodology also for this important scheduling problem

A Two-Phase ASP Encoding for Solving Rehabilitation Scheduling

The rehabilitation scheduling process consists of planning rehabilitation physiotherapy sessions for patients, by assigning proper operators to them in a certain time slot of a given day, taking into account several requirements and optimizations, e.g., patient’s preferences and operator’s work balancing. Being able to efficiently solve such problem is of upmost importance, in particular after the COVID-19 pandemic that significantly increased rehabilitation’s needs. In this paper, we present a solution to rehabilitation scheduling based on Answer Set Programming (ASP), which proved to be an effective tool for solving practical scheduling problems. Results of experiments performed on both synthetic and real benchmarks, the latter provided by ICS Maugeri, show the effectiveness of our solution

Introduction: Crime and Deviance through the Lens of Popular Culture

The introductory chapter sets out the collection’s theoretical framework, which favours a view of popular culture as an arena where issues of crime, deviance, criminal victimisation and justice are debated and negotiated. It draws attention to the mediatisation of the crime problem and the increasing academic interest in the interrelationship between crime, deviance and popular culture in the twenty-first century. In addition, this chapter introduces the five thematic sections of the collection and outlines the topics addressed in the chapters of each section

Rehabilitation and release of marine mammals in the United States : risks and benefits

Author Posting. © Society for Marine Mammalogy, 2007. This is the author's version of the work. It is posted here by permission of John Wiley & Sons for personal use, not for redistribution. The definitive version was published in Marine Mammal Science 23 (2007): 731-750, doi:10.1111/j.1748-7692.2007.00146.x.Rehabilitation of stranded marine mammals elicits polarized attitudes: initially done alongside display collections, but release of rehabilitated animals has become more common. Justifications include animal welfare, management of beach use conflict, research, conservation, and public education. Rehabilitation cost and risks have been identified which vary in degree supported by data rather than perception. These include conflict with fisheries for resources, ignorance of recipient population ecology, poor understanding of long term survival, support of the genetically not-so-fit, introduction of novel or antibiotic resistant pathogens, harm to human health and cost. Thus facilities must balance their welfare appeal against public education, habitat restoration, human impact reduction, and other conservation activities. Benefits to rehabilitating marine mammals are the opportunity to support the welfare of disabled animals and to publish good science and so advance our understanding of wild populations. In specific cases, the status of a population may make conservation the main reason for rehabilitation. These three reasons for rehabilitation lead to contrasting, and sometimes conflicting, management needs. We therefore outline a decision tree for rehabilitation managers using criteria for each management decision, based on welfare, logistics, conservation, research and funding to define limits on the number of animals released to the wild